Finding All Nash Equilibria of a Finite Game Using Polynomial Algebra
نویسنده
چکیده
The set of Nash equilibria of a finite game is the set of nonnegative solutions to a system of polynomial equations. In this survey article we describe how to construct certain special games and explain how to find all the complex roots of the corresponding polynomial systems, including all the Nash equilibria. We then explain how to find all the complex roots of the polynomial systems for arbitrary generic games, by polyhedral homotopy continuation starting from the solutions to the specially constructed games. We describe the use of Gröbner bases to solve these polynomial systems and to learn geometric information about how the solution set varies with the payoff functions. Finally, we review the use of Gambit to find all Nash equilibria of a finite game.
منابع مشابه
Good Nash Equilibria in Graphical Games ⋆
This paper addresses the problem of fair equilibrium selection in graphical games. Our approach is based on the data structure called the best response policy, which was proposed by Kearns et al. [12] as a way to represent all Nash equilibria of a graphical game. In [9], it was shown that the best response policy has polynomial size as long as the underlying graph is a path. In this paper, we s...
متن کاملCompact game representations in graph for computing Nash equilibria
Nash equilibrium is one of the most important concepts in game theory. A lot of research efforts are invested into finding Nash equilibria of games. Unfortunately, all existing methods for finding Nash equilibria of arbitrary games require exponential runtime. This makes the application of Nash equilibria impractical. Real world games often have topological independencies. An agent’s payoff doe...
متن کاملNash Equilibria via Polynomial Equations
We consider the problem of computing a Nash equilibrium in multiple-player games. It is known that there exist games, in which all the equilibria have irrational entries in their probability distributions [19]. This suggests that either we should look for symbolic representations of equilibria or we should focus on computing approximate equilibria. We show that every finite game has an equilibr...
متن کاملTowards a Black-Box Solver for Finite Games
This paper describes a new implementation of an algorithm to find all isolated Nash equilibria in a finite strategic game. The implementation uses the game theory software package Gambit to generate systems of polynomial equations which are necessary conditions for a Nash equilibrium, and polyhedral homotopy continuation via the package PHCpack to compute solutions to the systems. Numerical exp...
متن کاملCharacterization and Computation of Equilibria in Infinite Games
Broadly, we study continuous games (those with continuous strategy spaces and utility functions) with a view towards computation of equilibria. We cover all of the gametheoretic background needed to understand these results in detail. Then we present new work, which can be divided into three parts. First, it is known that arbitrary continuous games may have arbitrarily complicated equilibria, s...
متن کامل